Combinatorial characterization of read-once formulae

نویسندگان

  • Mauricio Karchmer
  • Nathan Linial
  • Ilan Newman
  • Michael E. Saks
  • Avi Wigderson
چکیده

We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. Those functions are called Read-Once. We use methods of combinatorial optimization and give as a corollary an alternative proof for some results of Seymour.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ampli cation by Read-Once Formulae

Moore and Shannon have shown that relays with arbitrarily high reliability can be built from relays with arbitrarily poor reliability. Valiant used similar methods to construct monotone read-once formulae of size O(n +2) (where = log p 5?1 2 ' 3:27) that amplify (? 1 n ; + 1 n) (where = p 5?1 2 ' 0:62) to (2 ?n ; 1 ? 2 ?n) and deduced as a consequence the existence of monotone formulae of the s...

متن کامل

Information Theory Methods in Communication Complexity

OF THE DISSERTATION Information theory methods in communication complexity by Nikolaos Leonardos Dissertation Director: Michael Saks This dissertation is concerned with the application of notions and methods from the field of information theory to the field of communication complexity. It consists of two main parts. In the first part of the dissertation, we prove lower bounds on the randomized ...

متن کامل

Ampli cation and Percolation

Moore and Shannon had shown that relays with arbitrarily high reliability can be built from relays with arbitrarily poor reliability. Valiant used similar methods to construct monotone read-once formulae of size O(n +2) (where = log p 5?1 2 ' 3:27) that amplify (? 1 n ; + 1 n) (where = p 5?1 2 ' 0:62) to (2 ?n ; 1 ? 2 ?n) and deduced as a consequence the existence of monotone formulae of the sa...

متن کامل

Testing Monotone Read-Once Functions

A checking test for a monotone read-once function f depending essentially on all its n variables is a set of vectors M distinguishing f from all other monotone read-once functions of the same variables. We describe an inductive procedure for obtaining individual lower and upper bounds on the minimal number of vectors T (f) in a checking test for any function f . The task of deriving the exact v...

متن کامل

On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae

In the boolean decision tree model there is at least a linear gap between the Monte Carlo and the Las Vegas complexity of a function depending on the error probability. We prove for a large class of read-once formulae that this trivial speed-up is the best what a Monte Carlo algorithm can achieve. For every formula F belonging to that class we show that the Monte Carlo complexity of F with two ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 114  شماره 

صفحات  -

تاریخ انتشار 1993